Point to Point Sensor Based Path Planning Algorithm for Autonomous Mobile Robots

نویسنده

  • Z. MOHAMAD
چکیده

The Bug algorithm is a local path planning methodology which detects the nearest obstacle as a mobile robot moves towards a target with limited information about the environment. It uses obstacle border as guidance toward the target. In Bug algorithm, the robot circumnavigates the obstacle till it finds certain condition to fulfill algorithm criteria to leave the obstacle toward target point. This paper introduces an approach utilizing a new algorithm called PointBug that attempts to minimize the use of outer perimeter of an obstacle (obstacle border) by looking for a few important points on the outer perimeter of obstacle area as a turning point to target and finally generates a complete path from source to target. The less use of outer perimeter of obstacle area produces shorter total path length taken by a mobile robot. This approach is then compared with other existing selected local path planning algorithm for total distance and a guarantee to reach the target. Key-Words: Path Planning, bug algorithm, autonomous robot, sensor based, mobile robot

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Effective Mechatronic Models and Methods for Implementation an Autonomous Soccer Robot

  Omni directional mobile robots have been popularly employed in several applications especially in soccer player robots considered in Robocup competitions. However, Omni directional navigation system, Omni-vision system and solenoid kicking mechanism in such mobile robots have not ever been combined. This situation brings the idea of a robot with no head direction into existence, a comprehensi...

متن کامل

3D Path Planning Algorithm for Mobile Anchor-Assisted Positioning in Wireless Sensor Networks

Positioning service is one of Wireless Sensor Networks’ (WSNs) fundamental services. The accurate position of the sensor nodes plays a vital role in many applications of WSNs. In this paper, a 3D positioning algorithm is being proposed, using mobile anchor node to assist sensor nodes in order to estimate their positions in a 3D geospatial environment. However, mobile anchor node’s 3D path optim...

متن کامل

An Optimal and Energy Efficient Multi-Sensor Collision-Free Path Planning Algorithm for a Mobile Robot in Dynamic Environments

There has been a remarkable growth in many different real-time systems in the area of autonomous mobile robots. This paper focuses on the collaboration of efficient multi-sensor systems to create new optimal motion planning for mobile robots. A proposed algorithm is used based on a new model to produce the shortest and most energy-efficient path from a given initial point to a goal point. The d...

متن کامل

Formation Control and Path Planning of Two Robots for Tracking a Moving Target

This paper addresses the dynamic path planning for two mobile robots in unknownenvironment with obstacle avoidance and moving target tracking. These robots must form atriangle with moving target. The algorithm is composed of two parts. The first part of thealgorithm used for formation planning of the robots and a moving target. It generates thedesired position for the robots for the next step. ...

متن کامل

Unification of Artificial Intelligence in Robot Motion and Path Planning Via Laplacian Technique

ABSTRACTThe paper deals with Robot motion and path planning in artificial intelligence. The aim of the paper is to develop a path planning programme for mobile robots that is based on laplacian technique. Robot path planning problem is an important combinational content of artificial intelligence and robotics. Its mission is to be independently movement from the starting point to the target poi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010